/**
*Tinh to hop m tu n, C(n, m)
*C(n, m) = 1 (neu = 0 hoac m = n)
*C(n, m) = C(n-1, m) + C(n-1, m-1)
*Viet chuong trinh de quy tinh C(n, m)
*/
int toHopCnm(int n, int m){
	if(m == 0 || m==n)
		return 1;
	else return toHopCnm(n-1, m) + toHopCnm(n-1, m-1);
}